Small and Large Time Scale Analysis of a Network Traffic Model

نویسندگان

  • KRISHANU MAULIK
  • SIDNEY RESNICK
چکیده

Recent empirical studies of the internet and WAN traffic data have observed multifractal behavior at time scales below a few hundred milliseconds. There have been some attempts to model this phenomenon, but there is no model to connect the small time scale behavior with behavior observed at large time scales of bigger than a few hundred milliseconds. There have been separate analyses of models for high speed data transmissions, which show that appropriate approximations to large time scale behavior of cumulative traffic are either fractional Brownian motion or stable Lévy motion, depending on the input rates assumed. This paper tries to bridge this gap and develops and analyzes a model offering an explanation of both the small and large time scale behavior of a network traffic model based on the infinite source Poisson model. Previous studies of this model have usually assumed that transmission rates are constant and deterministic. We consider a non-constant, multifractal, random transmission rate at the user level which results in cumulative traffic exhibiting multifractal behavior on small time scales and self-similar behavior on large time scales. Also, we model the file size and the transmission rate, which are more natural objects than the usually modeled transmission time and rate.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS

Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....

متن کامل

Optimal Design of FPI^λ D^μ based Stabilizers in Hybrid Multi-Machine Power System Using GWO ‎Algorithm

In this paper, the theory and modeling of large scale photovoltaic (PV) in the power grid and its effect on power system stability are studied. In this work, the basic module, small signal modeling and mathematical analysis of the large scale PV jointed multi-machine are demonstrated. The principal portion of the paper is to reduce the low frequency fluctuations by tuned stabilizer in the atten...

متن کامل

A new virtual leader-following consensus protocol to internal and string stability analysis of longitudinal platoon of vehicles with generic network topology under communication and parasitic delays

In this paper, a new virtual leader following consensus protocol is introduced to perform the internal and string stability analysis of longitudinal platoon of vehicles under generic network topology. In all previous studies on multi-agent systems with generic network topology, the control parameters are strictly dependent on eigenvalues of network matrices (adjacency or Laplacian). Since some ...

متن کامل

A New Mathematical Model To Optimize A Green Gas Network: A Case Study

Global warming created by large scale emissions of Greenhouse Gases (GHG) are a worldwide concern. Due to this, the issue of green gas network has required more attention in the last decades. Here, we address the GHG-based problem that arises in a gas network where gas flow is transferred from the Town Board Station (TBS) to consumers by pipeline systems. Given this environment, an optimization...

متن کامل

A Reliable Multi-objective p-hub Covering Location Problem Considering of Hubs Capabilities

In the facility location problem usually reducing total transferring cost and time are common objectives. Designing of a network with hub facilities can improve network efficiency. In this study a new model is presented for P-hub covering location problem. In the p-hub covering problem it is attempted to locate hubs and allocate customers to established hubs while allocated nodes to hubs are in...

متن کامل

AN ANT COLONY SYSTEM ALGORITHM FOR THE TIME DEPENDENT NETWORK DESIGN PROBLEM

Network design problem is one of the most complicated and yet challenging problems in transportation planning. The Bi-level, non-convex and integer nature of network design problem has made it into one of the most complicated optimization problems. Inclusion of time dimension to the classical network design problem could add to this complexity. In this paper an Ant Colony System (ACS) has been ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001